package leetCode;

/**
 * 704. 二分查找
 * https://leetcode.cn/problems/binary-search/description/
 */
class Solution1 {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left <= right) {
            //int mid = (left + right) / 2;
            int mid = left + (right - left) / 2;//防溢出
            if(target < nums[mid]) right = mid - 1;
            else if(target > nums[mid]) left = mid + 1;
            else return mid;
        }
        return -1;
    }
}